Monotone Separation of Logarithmic Space from Logarithmic Depth

نویسندگان

  • Michelangelo Grigni
  • Michael Sipser
چکیده

We show that the monotone analogue of logspace computation is more powerful than monotone log-depth circuits: monotone bounded fanin circuits for a certain function in monotone logspace require depth (lg 2 n).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-deterministic branching programs with logarithmic repetition cannot efficiently compute small monotone CNFs

In this paper we establish an exponential lower bound on the size of syntactic non-deterministic read d-times branching programs for d ≤ log n/10 computing a class of monotone CNFs with a linear number of clauses. This result provides the first separation of classes NP and co-NP for syntactic branching programs with a logarithmic repetition and the first separation of syntactic non-deterministi...

متن کامل

Valiant’s Polynomial-Size Monotone Formula for Majority

The existence of polynomial-size (monotone) formulae is known to be equivalent to the existence of logarithmic-depth (monotone) circuits of bounded fan-in. Anyhow, we shall prove the existence of logarithmic-depth monotone formulae (of bounded fan-in) for majority. Actually, two radically different proofs are known: The first proof uses a rather complicated construction of sorting networks of l...

متن کامل

Generalized Weighted Composition Operators From Logarithmic Bloch Type Spaces to $ n $'th Weighted Type Spaces

Let $ mathcal{H}(mathbb{D}) $ denote the space of analytic functions on the open unit disc $mathbb{D}$. For a weight $mu$ and a nonnegative integer $n$, the $n$'th weighted type space $ mathcal{W}_mu ^{(n)} $ is the space of all $fin mathcal{H}(mathbb{D}) $ such that $sup_{zin mathbb{D}}mu(z)left|f^{(n)}(z)right|begin{align*}left|f right|_{mathcal{W}_...

متن کامل

Parallelizing quantum circuits

We present a novel automated technique for parallelizing quantum circuits via forward and backward translation to measurement-based quantum computing patterns and analyze the trade oo in terms of depth and space complexity. As a result we distinguish a class of polynomial depth circuits that can be parallelized to logarithmic depth while adding only polynomial many auxiliary qubits. In particul...

متن کامل

Classification of Endometrial Images for Aiding the Diagnosis of Hyperplasia Using Logarithmic Gabor Wavelet

  Introduction: The process of discriminating among benign and malignant hyperplasia begun with subjective methods using light microscopy and is now being continued with computerized morphometrical analysis requiring some features. One of the main features called Volume Percentage of Stroma (VPS) is obtained by calculating the percentage of stroma texture. Currently, this feature is calculated ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comput. Syst. Sci.

دوره 50  شماره 

صفحات  -

تاریخ انتشار 1995